A Supertree Algorithm for Higher Taxa
نویسندگان
چکیده
منابع مشابه
Fast computation of supertrees for compatible phylogenies with nested taxa.
Typically, supertree methods combine a collection of source trees in which just the leaves are labeled by taxa. In such methods the resulting supertree is also leaf labeled. An underlying assumption in these methods is that across all trees in the collection, no two of the taxa are nested; for example, "buttercups" and "plants" are nested taxa. Motivated by Page, the first supertree algorithm f...
متن کاملPerformance of flip supertree construction with a heuristic algorithm.
Supertree methods are used to assemble separate phylogenetic trees with shared taxa into larger trees (supertrees) in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes (f...
متن کاملSubmitted 05.09.03 PERFORMANCE OF FLIP-SUPERTREE HEURISTIC Performance of Flip-Supertree Construction with a Heuristic Algorithm
Supertree methods assemble separate phylogenetic trees with shared taxa into larger trees, or supertrees, in an effort to construct more comprehensive phylogenetic hypotheses. In spite of much recent interest in supertrees, there are still few methods for supertree construction. The flip supertree problem is an error correction approach that seeks to find a minimum number of changes, or "flips"...
متن کاملImproved Heuristics for Minimum-Flip Supertree Construction
The utility of the matrix representation with flipping (MRF) supertree method has been limited by the speed of its heuristic algorithms. We describe a new heuristic algorithm for MRF supertree construction that improves upon the speed of the previous heuristic by a factor of n (the number of taxa in the supertree). This new heuristic makes MRF tractable for large-scale supertree analyses and al...
متن کاملSupertree Algorithms for Nested Taxa
Most supertree algorithms combine collections of rooted phylogenetic trees with overlapping leaf sets into a single rooted phylogenetic tree. It is implicit in all these algorithms that the leaves of the rooted phylogenetic trees in the input collection, as a whole, represent non-nested taxa. Thus, for example, the “domestic dog” and “mammal” cannot be represented by two distinct leaves in such...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014